By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
What Article options are available ?   View Cart   

Sorting, Approximate Sorting, and Searching in Rounds

Noga Alon and Yossi Azar

pp. 269-280

BibTeX  Abstract Full Text:  PDF

The Complexity of Colouring by Semicomplete Digraphs

Jørgen Bang-Jensen, Pavol Hell, and Gary MacGillivray

pp. 281-298

BibTeX  Abstract Full Text:  PDF

A New Heuristic for Partitioning the Nodes of a Graph

Earl R. Barnes, Anthony Vannelli, and James Q. Walker

pp. 299-305

BibTeX  Abstract Full Text:  PDF

A Class of Polynomially Solvable Set-Covering Problems

P. Bertolazzi and A. Sassano

pp. 306-316

BibTeX  Abstract Full Text:  PDF

Total Domination and Irredundance in Weighted Interval Graphs

Alan A. Bertossi and Alessandro Gori

pp. 317-327

BibTeX  Abstract Full Text:  PDF

The Diameter of a Cycle Plus a Random Matching

B. Bollobás and F. R. K. Chung

pp. 328-333

BibTeX  Abstract Full Text:  PDF

Unique Finite Difference Measurement

Peter C. Fishburn, Helen M. Marcus-Roberts, and Fred S. Roberts

pp. 334-354

BibTeX  Abstract Full Text:  PDF

Separating Partition Systems and Locally Different Sequences

János Körner and Gábor Simonyi

pp. 355-359

BibTeX  Abstract Full Text:  PDF

Certain Occupancy Numbers Via an Algorithm for Computing Their Ratios

Carl E. Langenhop and William E. Wright

pp. 360-371

BibTeX  Abstract Full Text:  PDF

Tournament Ranking with Expected Profit in Polynomial Time

Svatopluk Poljak, Vojtech Rödl, and Joel Spencer

pp. 372-376

BibTeX  Abstract Full Text:  PDF

Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures

Arie Tamir

pp. 377-396

BibTeX  Abstract Full Text:  PDF

Polynomial Bound for a Chip Firing Game on Graphs

Gábor Tardos

pp. 397-398

BibTeX  Abstract Full Text:  PDF

The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$

Prabhakar Ragde, William Steiger, Endre Szemerédi, and Avi Wigderson

pp. 399-410

BibTeX  Abstract Full Text:  PDF